自然灾害恢复重建的联盟博弈分析

自然灾害恢复重建的关键之一,是救济基金的筹集.论文基于联盟博弈的理论分析了国家财政拨款、地方财政拨款、红十字会等社会机构募捐三条途径,对国家财政、地方财政、社会募捐机构三方, 应筹集救济基金的比例进行了论证.使全社会对恢复重建救济基金筹集的满意度最大.     

回收再制造与定价决策模型及供应链协调分析

假定负责废旧产品回收再制造的生产商为主导者.针对单生产商和单零售商组成的逆向供应链,分析了Stackelberg博弈(分散式控制)下和合作(集中式控制)下的零售价和回收再制造率决策,发现集中式供应链的利润较高,给出了协调供应链的利润共享合同.针对单生产商和n个竞争零售商组成的供应链,分析了一主多从Stackelberg博弈和联合决策,结果表明供应链合作可降低产品的零售价格、提高回收再制造率和供应链总利润,进而给出了协调单生产商和n个零售商决策的利润共享合同.最后的算例表明了模型的合理性和协调合同的有效性.     

基于Shapley值法的三级闭环供应链收益分配模型

以合作博弈为基本研究方法,构建了由制造商、第三方物流和零售商组成的三级闭环供应链收益分配模型,不同合作方式下各合作联盟收益的特征函数的计算结果表明:在采取合作时,各合作联盟的收益均大于或等于各成员在不合作时各自的收益之和,文章验证了在三级闭环供应链收益分配模型中应用Shapley值法的可行性,说明构建的收益分配模型具有普遍适用性.然后运用Shapley值法求得三级闭环供应链收益分配的合理均衡解,最后结合算例进行了分析论证.     

A relation-algebraic approach to simple games

Simple games are a powerful tool to analyze decision-making and coalition formation in social and political life. In this paper, we present relation-algebraic models of simple games and develop relational specifications for solving some basic problems of them. In particular, we test certain fundamental properties of simple games and compute specific players and coalitions. We also apply relation algebra to determine power indices. This leads to relation-algebraic specifications, which can be evaluated with the help of the BDD-based tool Rel View after a simple translation into the tool’s programming language. In order to demonstrate the visualization facilities of Rel View we consider an example of the Catalonian Parliament after the 2003 election.     

A bargaining game model for measuring performance of two-stage network structures

Data envelopment analysis (DEA) is a method for measuring the efficiency of peer decision making units (DMUs), where the internal structures of DMUs are treated as a black-box. Recently DEA has been extended to examine the efficiency of DMUs that have two-stage network structures or processes, where all the outputs from the first stage are intermediate measures that make up the inputs to the second stage. The resulting two-stage DEA model not only provides an overall efficiency score for the entire process, but also yields an efficiency score for each of the individual stages. The current paper develops a Nash bargaining game model to measure the performance of DMUs that have a two-stage structure. Under Nash bargaining theory, the two stages are viewed as players and the DEA efficiency model is a cooperative game model. It is shown that when only one intermediate measure exists between the two stages, our newly developed Nash bargaining game approach yields the same results as applying the standard DEA approach to each stage separately. Two real world data sets are used to demonstrate our bargaining game model.     

关于良定问题

本文应用有限理性模型M,对非线性问题的良定性进行了统一的研究,对最优化、多目标最优化、非合作博弈和广义博弈得到了一些新的良定性结果.     

利用有机波谱教学网站iSpec进行游戏化课堂教学的实践*

针对学生在有机化学波谱学学习过程中枯燥、难以形象化的具体情况,介绍一个利用有机波谱在线学习的网站进行游戏化课堂教学的学习活动,以期提升学生在该课程学习中的积极性及学习效果。该教学活动的实施分为课堂和课后进行,主要依托iSpec网站游戏竞赛的答题模式,结合教师课堂教学及学生自主学习,进行相关知识技能的教授,最终提升学生的学习效率与效果。     

q-Strategy spatial prisoner?s dilemma game

We generalize the usual two-strategy prisoner?s dilemma game to a multi-strategy game, in which the strategy variable s is allowed to take q different fractional values lying between 0 and 1. The fractional-valued strategies signify that individuals are not absolutely cooperative or defective, instead they can adopt intermediate strategies. Simulation results on 1D and 2D lattices show that, compared with the binary strategy game, the multi-strategy game can sustain cooperation in more stringent defective environments. We give a comprehensive analysis of the distributions of the survived strategies and we compare pairwise the relative strength and weakness of different strategies. It turns out that some intermediate strategies survive the pure defection because they can reduce being exploited and at the same time benefit from the spatial reciprocity effect. Our work may shed some light on the intermediate behaviors in human society.     

Complexity of core allocation for the bin packing game

This paper provides complexity results and develops optimal algorithms for core membership and emptiness tests of the bin packing game. Our algorithms find the maximum surplus profit, the least integer core value, and the minimum value required by the grand coalition for the existence of an integer core allocation.     

一类组合优化函数的若干研究

本文研究了一个组合优化问题.利用组合数论的理论,给出了计算优化函数的一个新方法,并确定了4≤4m≤120时优化函数g(4m,6)的准确值,以及相心的优化向量.